Sublinear Graph Approximation Algorithms
نویسنده
چکیده
Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Is there a way to compute/approximate it without finding: large matching, large independent set, small vertex cover, small dominating set? Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32
منابع مشابه
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms
We consider the problem of estimating the size, V C(G), of a minimum vertex cover of a graph G, in sublinear time, by querying the incidence relation of the graph. We say that an algorithm is an (α, )approximation algorithm if it outputs with high probability an estimate V̂ C such that V C(G) − n ≤ V̂ C ≤ α · V C(G) + n, where n is the number of vertices of G. We show that the query complexity of...
متن کاملPrinciples of Distributed Computing 1 Approximating Maximum Matching
In this lecture, we discuss sublinear-time centralized algorithms for graph problems. As we shall see soon, the core part of these algorithms is a local procedure, quite similar to the LOCAL distributed algorithms that we have been discussing over the past few lectures. Sublinear-time (centralized) algorithms are gaining importance with the constant increase in the size of the graph problems th...
متن کامل05291 Abstracts Collection Sublinear Algorithms Dagstuhl Seminar
From 17.07.05 to 22.07.05, the Dagstuhl Seminar 05291 Sublinear Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are...
متن کاملPrinciples of Distributed Computing 04 / 12 , 2017 Lecture
In this lecture, we discuss sublinear-time centralized algorithms for graph problems. As we shall see soon, the core part of these algorithms is a local procedure, quite similar to the LOCAL distributed algorithms that we have been discussing over the past few lectures. Sublinear-time (centralized) algorithms are gaining importance with the constant increase in the size of the graph problems th...
متن کاملCse 522: Sublinear (and Streaming) Algorithms Lecture 17: Tolerant Testing, Graph Algorithms/streaming 2 Sublinear Mutliplicative-additive Approximation Algorithms
This gives complete freedom to answer if the input is close to having property P but does not exactly have this property. It is natural to think of property testing algorithms for which the input queries might have a very small probability of error. In this case it would be good to be able to separate inputs that are ε-far from having property P from those that are ε′-close to having property P...
متن کامل